A Generalized Markovian Queue to Model an Optical Packet Switching Multiplexer
نویسندگان
چکیده
Packet and burst switching have been proposed for optical networks because they can better accommodate bursty traffic generated by IP applications. In optical packet switching networks the payload and the header of the same packet are conveyed in the same channel, while burst switching networks allow the separate transportation of the payload and the header of the same burst. In this paper we consider an optical packet switching node that assigns arriving packets to channels in a link with c available data channels (wavelengths) and a buffer of L − c size. The paper applies the novel MM ∑K k=1 CPPk /GE/c/L G-queue to model optical packet switching nodes. It is worth emphasizing that our method can be applied to model burst switching nodes as well. Moreover, we show that a model previously presented in the literature is only the special case of our model. Numerical results quantitatively demonstrate that the characteristics (e.g.: burstiness) of the offered traffic have a significant impact on the performance of optical nodes.
منابع مشابه
A Generalized Markovian Queue and Its Applications to Performance Analysis in Telecommunications Networks
In this paper the MM ∑K k=1 CPPk/GE/c/L G-queue is introduced and proposed as a generalised Markovian node model in telecommunications networks. An exact and computationally efficient solution is obtained for the steady-state probabilities and performance measures. Issues concerning the computational effort are also discussed. The proposed queue is applied to the performance analysis of optical...
متن کاملQueueing of Correlated Packet-trains : an Analytic Performance Study
We study a statistical multiplexer that is modelled as a discrete-time single-server queueing system with infinite capacity. At the input of the multiplexer, there is a possibly unbounded population of users that generate ‘low-speed’ messages. Each such message is composed of a variable number of fixed-length packets which consecutively enter the queue at the speed of one packet per time slot. ...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملPhotonic Network Technologies for New Generation Network
In this paper, we show the recent progress of photonic network technologies for the new generation network (NWGN). The NWGN is based on new design concepts that look beyond the next generation network (NGN) and the Internet. The NWGN will maintain the sustainability of our prosperous civilization and help resolve various social issues and problems by the use of information and communication tec...
متن کاملTraffic smoothing effects of bit dropping in a packet voice multiplexer
Recent studies have shown that the superposition of packet sequences generated by packetized voice sources with speech detection exhibit high burstiness due to inherent correlations between successive interarrival times in the superposition stream. In a packet voice multiplexer without bit dropping, these correlations tend to cause significantly larger queueing delays and packet losses than wou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003